A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design
نویسنده
چکیده
In this paper we construct a class of regular Low Density Parity Check (LDPC) codes derived from Latin squares. The parity check matrices of these codes are constructed by permuting shift-orthogonal Latin squares of order n in blockrows and block-columns. I show that the constructed LDPC codes are self-orthogonal and their minimum and stopping distances are bounded. This helps us to construct a family of quantum LDPC block codes. Consequently, we demonstrate that these constructed codes have good error correction capabilities and can be decoded using iterative decoding algorithms similar to their classical counterpart.
منابع مشابه
On Quantum and Classical Error Control Codes: Constructions and Applications
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor’s algorithm is able to factor large integers in polynomial time on a quantum computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a formidable task to build a quantum computer, since...
متن کاملLDPC Codes from Latin Squares Free of Small Trapping Sets
This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these codes are arrays of permutation matrices which are obtained from Latin squares and form a finite field under some matrix operations. Second, a method to constru...
متن کاملA Class of High-rate, Low-complexity, Well- structured LDPC Codes from Combinatorial Designs and their Applications on ISI Channels
We present a systematic construction of a class of highrate, well-structured low density parity check (LDPC) codes based on combinatorial designs. We show that the proposed -design results in a class of -regular LDPC codes, which are systematic, quasicyclic, free of length-4 and length-6 cycles, linear-time encodable and decodable, and which have high code rates of . Analysis from the maximum l...
متن کاملHigh Rate LDPC Codes from Difference Covering Arrays
This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over the past 20 years researchers have used a variety of more structured approaches to construct these codes, with the more recent constructions of well-structured...
متن کاملAbsorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel
In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from sets of mutually orthogonal Latin squares (MOLS) with cyclic structure. For lowering the error-floors, our approach is twofold: First, we give an exhaustive cl...
متن کامل